A strong direct product theorem for quantum query complexity
نویسندگان
چکیده
منابع مشابه
A strong direct product theorem for two-way public coin communication complexity
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of J, Klauck and Nayak [JKN08], thereby our result implying their direct product result in terms of the two-way product subdistribution ...
متن کاملA Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Disjointness
We prove that two-party randomized communication complexity satisfies a strong direct product property, so long as the communication lower bound is proved by a “corruption” or “one-sided discrepancy” method over a rectangular distribution. We use this to prove new n lower bounds for numberon-the-forehead protocols in which the first player speaks once and then the other two players proceed arbi...
متن کاملA New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proved by Klauck, Špalek, and de Wolf (FOCS’04) using the polynomials method. No proof using the ad...
متن کاملA new quantum lower bound method, with an application to strong direct product theorem for quantum search
We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of adversary method, by analyzing the eigenspace structure of the problem. Using the new method, we prove a strong direct product theorem for quantum search. This result was previously proven by Klauck, Špalek and de Wolf (quant-ph/0402123) using polynomials method. No proof using advers...
متن کاملA Composition Theorem for Randomized Query Complexity
Let the randomized query complexity of a relation for error probability ǫ be denoted by Rǫ(·). We prove that for any relation f ⊆ {0, 1} × R and Boolean function g : {0, 1} → {0, 1}, R1/3(f ◦g ) = Ω(R4/9(f) ·R1/2−1/n4(g)), where f ◦g n is the relation obtained by composing f and g. We also show that R1/3 (
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2013
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-013-0066-8